41 Range Searching

نویسنده

  • Pankaj K. Agarwal
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Geometric Range Searching and Its Relatives

About ten years ago, the eld of range searching, especially simplex range searching, was wide open. At that time, neither e cient algorithms nor nontrivial lower bounds were known for most range-searching problems. A series of papers by Haussler and Welzl [161], Clarkson [88, 89], and Clarkson and Shor [92] not only marked the beginning of a new chapter in geometric searching, but also revitali...

متن کامل

Title of Dissertation : Approximate Range Searching In The Absolute Error Model Guilherme

Title of Dissertation: Approximate Range Searching In The Absolute Error Model Guilherme Dias da Fonseca, Doctor of Philosophy, 2007 Dissertation directed by: Professor David M. Mount Department of Computer Science Range searching is a well known problem in computational geometry. We consider this problem in the context of approximation, where an approximation parameter ε > 0 is provided. Most ...

متن کامل

Invited Lecture: On Approximate Range Searching - or - Get in Shape; Round is a Good Choice

Range searching is among the most fundamental and well-studied problems in computational geometry. Given an n-element point set in R, the problem is to preprocess the points so that the total weight, or generally the semigroup sum, of the points lying within a given query range η can be determined quickly. Years of research have resulted in nearly matching upper and lower bounds for many formul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016